Embedding theorems for proper inverse semigroups

On Some Embedding Theorems for Inverse Semigroups

A semilattice decomposition of an inverse semigroup has good internal mapping properties. These are used to give natural proofs of some embedding theorems, which were originally proved in a rather artificial way. The reader is referred to [1] for the basic theory of inverse semigroups. In an earlier paper [3] we proved the following embedding result: (1) An E-unitary inverse semigroup is isomor...

Embedding theorems for HNN extensions of inverse semigroups

We discuss embedding theorems for HNN extensions and clarify the relationship between the concept by Gilbert and that of Yamamura. We employ the automata theoretical technique based on the combinatorial and geometrical properties of Schützenberger graphs.

Amalgamation for Inverse and Generalized Inverse Semigroups

For any amalgam (S, T; U) of inverse semigroups, it is shown that the natural partial order on S *u T, the (inverse semigroup) free product of S and T amalgamating U, has a simple form onSUT. In particular, it follows that the semilattice of 5 *u T is a bundled semilattice of the corresponding semilattice amalgam (E(S), E(T); E(U)); taken jointly with a result of Teruo Imaoka, this gives that t...

Anisimov's Theorem for inverse semigroups

The idempotent problem of a finitely generated inverse semi-group is the formal language of all words over the generators representing idempotent elements. This note proves that a finitely generated inverse semigroup with regular idempotent problem is necessarily finite. This answers a question of Gilbert and Noonan Heale, and establishes a gen-eralisation to inverse semigroups of Anisimov's Th...

Inverse Approximation Theorems for . . .